Soft Linear Logic and the Polynomial Hierarchy
نویسنده
چکیده
In this paper we argue that Lafont’s system of Soft Linear Logic [3] is expressive enough to characterize any level of the Polynomial Hierarchy. This characterization is obtained using the existing additive connectives and does not require the introduction of new rules to SLL.
منابع مشابه
On Elementary Linear Logic and polynomial time
Linear logic (LL) [Gir87] has been used in implicit computational complexity to characterize various complexity classes within the proofs-as-programs approach. This can then be the basis of type systems to guarantee complexity properties on lambda-calculus. As duplication is controlled in LL by the connective ! the key idea of this line of work is to consider variants of this system with a weak...
متن کاملOn the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
Elementary linear logic is a simple variant of linear logic due to Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say functions computable in time bounded by a tower of exponentials of fixed height. Other systems like light and soft linear logics have then been defined to characterize in a similar way the more interesting complexi...
متن کاملA geographic information system for gas power plant location using analytical hierarchy process and fuzzy logic
This study recommends a GIS-based (Geographic Information Systems) and multi-criteria evaluation for site selection of gas power plant in Natanz City of Iran. The multi-criteria decision framework integrates legal requirements and physical constraints related to environmental and economic concerns. It also builds a hierarchy model for gas power plant suitability. The methodologies used for site...
متن کاملElementary linear logic revisited for polynomial time and an exponential time hierarchy (extended version)
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions (computable in time bounded by a tower of exponentials of fixed height). Other systems, like light linear logic have then been defined to capture in a similar way polynomial time functions, but at the price of either a mor...
متن کاملSoft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms of this calculus are reducible in polynomial time. We then extend the type system of Soft logic with recursive types. This allows us to consider non-standard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014